Complete Axiomatization of Observation Congruence for Pmc Complete Axiomatization of Observation Congruence for Pmc
نویسندگان
چکیده
In AM93b] an asynchronous process algebra with multiple clocks, called PMC, was introduced and a complete axiomatization of strong bisimulation equivalence was given for a class of nite state processes. In this report we show how to extend the equational calculus so as to arrive at a complete axiomatization of observation congruence. Completeness is proven for the class of nite processes. With this extension in place the equational theory of PMC supports the veriication of reenement-by-decomposition.
منابع مشابه
The Complete Axiomatization of Cs-congruence
The coupled simulation equivalence is slightly larger than observation equivalence. Where observation equivalence is based on weak bisimulations, coupled simulation equivalence is based on pairs of simulations which coincide at stable states. We establish the corresponding congruence and provide a complete axiomatization by adding a new-law, :(:P + Q) = :P + Q, to the axioma-tization of observa...
متن کاملAn Asynchronous Process Algebra with Mult iple Clocks
In this paper we introduce a novel approach to the specification of real-time behaviour with process algebras. In contrast to the usual pattern, involving a fixed, measurable, and global notion of time, we suggest to represent real-time constraints indirectly through uninterpreted clocks enforcing broadcast synchronization between processes. Our approach advocates the use of asynchronous proces...
متن کاملAn Asynchronous Process Algebra withMultiple
In this paper we introduce a novel approach to the speciication of real-time behaviour with process algebras. In contrast to the usual pattern, involving a xed, measurable, and global notion of time, we suggest to represent real-time constraints indirectly through uninterpreted clocks enforcing broadcast synchronization between processes. Our approach advocates the use of asynchronous process a...
متن کاملACompleteEquationalAxiomatization for Prefix Iteration with Silent Steps
Fokkink ((1994) Inf. Process. Lett. 52: 333–337) has recently proposed a complete equational axiomatization of strong bisimulation equivalence for MPAδ(Aτ ), i.e., the language obtained by extending Milner’s basic CCS with prefix iteration. Prefix iteration is a variation on the original binary version of the Kleene star operation p∗q obtained by restricting the first argument to be an atomic a...
متن کاملOn the Complete Axiomatization for Prefix Iteration modulo Observation Congruence
Prefix iteration is a variation on the original binary version of the Kleene star operation P ∗Q, obtained by restricting the first argument to be an atomic action. Aceto and Ingólfsdóttir provided an axiom system for observation congruence over basic CCS with prefix iteration. However hitherto the only direct completeness proof given for such a system is very long and technical. In this paper,...
متن کامل